SOME ABSTRACT PIVOT ALGORITHMS.GREENE C; MAGNANTI TL.1975; S.I.A.M. J. APPL. MATH.; U.S.A.; DA. 1975; VOL. 29; NO 3; PP. 530-539; BIBL. 18 REF.Article

Pivoted block solvers for large banded linear equation systemsSTABROWSKI, M. M.Communications in numerical methods in engineering. 1997, Vol 13, Num 5, pp 407-415, issn 1069-8299Article

Prepivoting test statistics: a bootstrap view of asymptotic refinementsBERAN, R.Journal of the American Statistical Association. 1988, Vol 83, Num 403, pp 687-697, issn 0162-1459Article

A stable algorithm for updating triangular factors under a rank one changeFLETCHER, R; MATTHEWS, S. P. J.Mathematics of computation. 1985, Vol 45, Num 172, pp 471-485, issn 0025-5718Article

A VIEW OF COMPLEMENTARY PIVOT THEORYEAVES BC.1979; LECTURE NOTES MATH.; DEU; DA. 1979; NO 730; PP. 89-111; BIBL. 34 REF.Conference Paper

CLASSES OF FUNCTIONS AND FEASIBILITY CONDITIONS IN NONLINEAR COMPLEMENTARITY PROBLEMS.MORE JJ.1974; MATH. PROGRAMMG; NETHERL.; DA. 1974; VOL. 6; NO 3; PP. 327-338; BIBL. 20 REF.Article

A COMPARISON OF SPARSITY ORDERINGS FOR OBTAINING A PIVOTAL SEQUENCE IN GAUSSIAN ELIMINATION. = COMPARAISON DES ORDRES D'EPARPILLEMENT POUR OBTENIR UNE SEQUENCE DE PIVOTS EN ELIMINATION GAUSSIENNEDUFF IS; REID JK.1974; J. INST. MATH. APPL., LONDON; G.B.; DA. 1974; VOL. 14; NO 3; PP. 281-291; BIBL. 17 REF.Article

Efficient algorithm for computing QFT boundsYANG, Shih-Feng.International journal of control. 2010, Vol 83, Num 4, pp 716-723, issn 0020-7179, 8 p.Article

The finite criss-cross method for hyperbolic programmingILLES, T; SZIRMAI, A; TERLAKY, T et al.European journal of operational research. 1999, Vol 114, Num 1, pp 198-214, issn 0377-2217Article

Linear stationary point problems on unbounded polyhedraYANG DAI; TALMAN, D.Mathematics of operations research. 1993, Vol 18, Num 3, pp 635-644, issn 0364-765XArticle

On anti-cycling pivoting rules for the simplex methodZHANG, S.Operations research letters. 1991, Vol 10, Num 4, pp 189-192, issn 0167-6377Article

On threshold pivoting in the multifrontal method for sparse in definite systemsLIU, J. W. H.ACM transactions on mathematical software. 1987, Vol 13, Num 3, pp 250-261, issn 0098-3500Article

How branch mispredictions affect quicksortKALIGOSI, Kanela; SANDERS, Peter.Lecture notes in computer science. 2006, pp 780-791, issn 0302-9743, isbn 3-540-38875-3, 1Vol, 12 p.Conference Paper

Scaled pivoting in Gauss and Neville elimination for totally positive systemsGASCA, M; PENA, J. M.Applied numerical mathematics. 1993, Vol 13, Num 5, pp 345-355, issn 0168-9274Article

Base-p-cyclic reduction for tridiagonal systems of equationsDE GROEN, P. P. N.Applied numerical mathematics. 1991, Vol 8, Num 2, pp 117-125, issn 0168-9274Article

A method of increasing the stability of an implicit upwind scheme with three-point scalar pivotal condensations for Euler's equationKOZLOV, V. E.U.S.S.R. computational mathematics and mathematical physics. 1990, Vol 30, Num 5, pp 232-234, issn 0041-5553Article

Principal pivot transforms of some classes of matricesNEOGY, S. K; DAS, A. K.Linear algebra and its applications. 2005, Vol 400, pp 243-252, issn 0024-3795, 10 p.Article

A new exterior point algorithm for linear programming problemsDOSIOS, K; PAPARRIZOS, K.Yugoslav journal of operations research. 1994, Vol 4, Num 2, pp 137-148, issn 0354-0243Conference Paper

Least-index resolution of degeneracy in linear complementarity problems with sufficient matricesCOTTLE, R. W; YO-YIEH CHANG.SIAM journal on matrix analysis and applications. 1992, Vol 13, Num 4, pp 1131-1141, issn 0895-4798Article

A tree model for sparse symmetric indefinite matrix factorizationLIU, J. W. H.SIAM journal on matrix analysis and applications. 1988, Vol 9, Num 1, pp 26-39, issn 0895-4798Article

Orthogonal method for linear systems. PreconditioningHERRERO, Henar; CASTILLO, Enrique; PRUNEDA, Rosa Eva et al.Lecture notes in computer science. 2002, issn 0302-9743, isbn 3-540-43591-3, 3Vol, vol. 2, 374-382Conference Paper

A framework for efficient sparse LU factorization in a cluster based platformGRIGORI, Laura.Lecture notes in computer science. 2002, pp 118-125, issn 0302-9743, isbn 3-540-43672-3, 8 p.Conference Paper

The growth factor and efficiency of Gaussian elimination with rook pivotingFOSTER, L. V.Journal of computational and applied mathematics. 1997, Vol 86, Num 1, pp 177-194, issn 0377-0427Article

Exploiting structural symmetry in a sparse partial pivoting codeEISENSTAT, S. C; LIU, J. W. H.SIAM journal on scientific and statistical computing. 1993, Vol 14, Num 1, pp 253-257, issn 0196-5204Article

Page / 10